FOUNDATIONAL AND MATHEMATICAL USES OF HIGHER TYPES ULRICH KOHLENBACH† DEDICATED TO SOLOMON FEFERMAN FOR HIS 70TH BIRTHDAY §1. Introduction. A central theme of proof theory is expressed by the following question:

Source URL: www.mathematik.tu-darmstadt.de

• Computability theory
• Proof theory
• Mathematical logic
• Metalogic
• Reverse mathematics
• Primitive recursive functional
• Second-order arithmetic
• Peano axioms
• Primitive recursive function
• Primitive recursive arithmetic
• Model theory
• Symbol

A Supercompiler for Core Haskell Neil Mitchell and Colin Runciman University of York, UK, http://www.cs.york.ac.uk/~ndm Abstract. Haskell is a functional language, with features such as higher order functions and lazy ev

Source URL: ndmitchell.com

• Software engineering
• Mathematics
• Declarative programming
• Lambda calculus
• Functional programming
• Functions and mappings
• Let expression
• Embedding
• Monad
• Anonymous function

Supero: Making Haskell Faster Neil Mitchell and Colin Runciman University of York, UK, http://www.cs.york.ac.uk/~ndm Abstract. Haskell is a functional language, with features such as higher order functions and lazy evalu

Source URL: ndmitchell.com

• Software engineering
• Computer programming
• Declarative programming
• Functional programming
• Lambda calculus
• Subroutines
• Functional languages
• Literate programming
• Monad
• Let expression
• Glasgow Haskell Compiler
• Anonymous function

Opening the Black Boxes in Data Flow Optimization †4 Fabian Hueske*1 Mathias Peters†2 Matthias J. Sax†3 Astrid Rheinlander

Source URL: stratosphere.eu

• Software engineering
• Computer programming
• Computing
• Functional analysis
• Distributed computing architecture
• Parallel computing
• Parallelization contract
• Relational database
• Restriction
• Relational model
• Operator
• Higher-order function

Covariant Derivatives and the Hamilton-Jacobi Equation Sabrina Gonzalez Pasterski (Dated: March 2, 2014) I define a covariant derivative to simplify how higher order derivatives act on a classical generating function.

Source URL: physicsgirl.com

Higher-Order and Symbolic Computation, 11, 363–c 1998 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. ° Definitional Interpreters

Source URL: cs.au.dk

• Software engineering
• Computer programming
• Computing
• Lambda calculus
• Subroutines
• Models of computation
• Functional programming
• Theoretical computer science
• Lisp
• Eval
• Expression
• Anonymous function

The State of the Art in Gradual Typing Jeremy G. Siek Indiana University, Bloomington SICSA Summer School on Practical Types University of St. Andrews

Source URL: dl.dropboxusercontent.com

• Type systems
• Procedural programming languages
• Type theory
• Data types
• Gradual typing
• Boo
• Manifest typing
• Higher-order function

Semantic Bidirectionalization Revisited Meng Wang Shayan Najd Computer Science and Engineering

Source URL: kar.kent.ac.uk

• Functional programming
• Type theory
• Data types
• Higher-order functions
• Generic programming
• Type class
• Bidirectionalization
• Function
• ALGOL 68
• Software engineering
• Computing
• Computer programming

OXFORD UNIVERSITY PRESS LTD JOURNAL), 1–26 doi:OUP Journal/XXX000 Beyond dimension two: A test for higher-order tail risk Carsten Bormann1 , Julia Schaumburg 2 , and Melanie Schienle3 1

Source URL: www.ewifo.uni-hannover.de

• Covariance and correlation
• Data analysis
• Multivariate statistics
• Copula
• Normal distribution
• Pearson product-moment correlation coefficient
• Cumulative distribution function
• Correlation and dependence
• Bootstrapping
• Statistics
• Statistical dependence
• Actuarial science

F# Succinct, Expressive, Functional The F# Team Microsoft Developer Division Microsoft Research

Source URL: www.erlang-factory.com

• Mathematical notation
• Tuple
• Type theory
• Function
• Fold
• Mathematics
• Higher-order functions
• Data management